OPERATIONAL VARIABLE JOB SCHEDULING WITH ELIGIBILITY CONSTRAINTS: A RANDOMIZED CONSTRAINT‐GRAPH‐BASED APPROACH
نویسندگان
چکیده
منابع مشابه
Flexible job shop scheduling under availability constraints
In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...
متن کاملJob Scheduling with Unfixed Availability Constraints
Standard scheduling theory assumes that all machines are continuously available throughout the planning horizon. In many manufacturing and service management situations however, machines need to be maintained periodically to prevent malfunctions. During the maintenance period, a machine is not available for processing jobs. Hence, a more realistic scheduling model should take into account machi...
متن کاملImproved bounds for online scheduling with eligibility constraints
We consider the online parallel machine scheduling problem of minimizing the makespan under eligibility constraints that restrict each job to be processed only on one of its eligible machines. The greedy approach known as AW is known to be optimal for this problem when the number of machines, m, is a power of 2, i.e. m = 2k. However, in other cases, the gap between the best known competitive ra...
متن کاملHeuristics for operational fixed job scheduling problems with working and spread time constraints
Operational fixed job scheduling problems select a set of jobs having fixed ready and processing times and schedule the selected jobs on parallel machines so as to maximize the total weight. In this study, we consider working time and spread time constrained versions of the operational fixed job scheduling problems. The working time constraints limit the total processing load on each machine. T...
متن کاملflexible job shop scheduling under availability constraints
in this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. this study seems utterly new and it is applicable to any performance measure based on the completion time. the in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Technological and Economic Development of Economy
سال: 2009
ISSN: 2029-4913,2029-4921
DOI: 10.3846/1392-8619.2009.15.245-266